Discourse dependency structures as DAGs
نویسندگان
چکیده
Résumé We show that the semantic level for discourses, understood as a dependency representation, can be mathematically characterized as DAGs. Our argumentation is based on discourses with three clauses and two discourse connectives. This simple case allows us to state that DAGs for discourses are not arbitrary: they present structural constraints. Nous montrons que les représentations sémantiques pour les discours, conçues comme des représentations de dépendances sémantiques, ont la structure mathématique d’un DAG. Notre argumentation repose sur des discours très simples, à savoir sur les discours comportant trois propositions et deux connecteurs de discours. Ces discours, bien que simples, permettent d’aboutir à une conclusion importante : les DAG représentant les discours ne sont pas arbitraires, ils présentent des contraintes structurelles.
منابع مشابه
Discourse Dependency Structures as Constrained DAGs
I show that the semantic structure for discourses, understood as a dependency representation, can be mathematically characterized as DAGs, but these DAGs present heavy structural constraints. The argumentation is based on a simple case, i.e. discourses with three clauses and two discourse connectives. I show that only four types of DAGs are needed for these discourses.
متن کاملStrong generative capacity of RST, SDRT and discourse dependency DAGSs
The aim of this paper is to compare the discourse structures proposed in RST, SDRT and dependency DAGs which extend the semantic level of MTT for discourses. The key question is the following: do these formalisms allow the representation of all the discourse structures which correspond to felicitous discourses and exclude those which correspond to infelicitous discourses? Hence the term of “str...
متن کاملInteger Linear Programming for Discourse Parsing
In this paper we present the first, to the best of our knowledge, discourse parser that is able to predict non-tree DAG structures. We use Integer Linear Programming (ILP) to encode both the objective function and the constraints as global decoding over local scores. Our underlying data come from multi-party chat dialogues, which require the prediction of DAGs. We use the dependency parsing par...
متن کاملCausal networks: semantics and expressiveness
Dependency knowledge of the form "x is independent ofy once z is known" invariably obeys the four graphoid axioms, examples include probabilistic and database dependencies. Often, such knowledge can be represented efficiently with graphical structures such as undirected graphs and directed acyclic graphs (DAGs). In this paper we show that the graphical criterion called d-separation is a sound r...
متن کاملPolarized Unification Grammars
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects of the elementary structures controls the saturation of the final structure. This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency gra...
متن کامل